A Sidon-type condition on set systems
نویسندگان
چکیده
منابع مشابه
H$^*$-condition on the set of submodules of a module
In this work, we introduce $H^*$-condition on the set of submodules of a module. Let $M$ be a module. We say $M$ satisfies $H^*$ provided that for every submodule $N$ of $M$, there is a direct summand$D$ of $M$ such that $(N+D)/N$ and $(N+D)/D$ are cosingular. We show that over a right perfect right $GV$-ring,a homomorphic image of a $H^*$ duo module satisfies $H^*$.
متن کاملOn a class of Kirchhoff type systems with nonlinear boundary condition
A class of Kirchhoff type systems with nonlinear boundary conditions considered in this paper. By using the method of Nehari manifold, it is proved that the system possesses two nontrivial nonnegative solutions if the parameters are small enough.
متن کاملOn Uniformly Approximable Sidon Sets
Let G be a compact abelian group and let T be the character group of G. Suppose £ is a subset of T. A trigonometric polynomial f on G is said to be an ^-polynomial if its Fourier transform / vanishes off E. The set E is said to be a Sidon set if there is a positive number B such that 2^xeb |/(X)| á-B||/||u for all E-polynomials /; here, ||/||„ = sup{ |/(x)| : xEG}. In this note we shall discuss...
متن کاملThe number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...
متن کاملOn Multiplicative Sidon Sets
Fix integers b > a ≥ 1 with g := gcd(a, b). A set S ⊆ N is {a, b}-multiplicative if ax 6= by for all x, y ∈ S. For all n, we determine an {a, b}-multiplicative set with maximum cardinality in [n], and conclude that the maximum density of an {a, b}-multiplicative set is b b+g . Erdős [2, 3, 4] defined a set S ⊆ N to be multiplicative Sidon1 if ab = cd implies {a, b} = {c, d} for all a, b, c, d ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2013
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2013.v4.n4.a4